Maximum vertex occupation time and inert fugitive: Recontamination does help
نویسندگان
چکیده
منابع مشابه
Maximum vertex occupation time and inert fugitive: Recontamination does help
Given a simple graph G, we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a search of G. We prove that a search program which does not allow a recontamination may not find an optimal solution to this problem. Moreover, the difference betw...
متن کاملMonotonicity and inert fugitive search games
In general, graph search can be described in terms of a sequence of searchers’ moves on a graph, able to capture a fugitive resorting on its vertices/edges. Several variations of graph search have been introduced, differing on the abilities of the fugitive as well as of the search. In this paper, we examine the case where the fugitive is inert, i.e., it moves only whenever the search is about t...
متن کاملDeducing Vertex Weights from Empirical Occupation Times
We consider the following problem arising from the study of human problem solving: Let G be a vertex-weighted graph with marked “in” and “out” vertices. Suppose a random walker begins at the invertex, steps to neighbors of vertices with probability proportional to their weights, and stops upon reaching the out-vertex. Could one deduce the weights from the paths that many such walkers take? We a...
متن کاملDoes time help to understand consciousness?
In response to our target paper on the possible role of temporal binding for consciousness (Engel et al., 1999), a number of arguments have been raised that, to varying degrees and on varying grounds, doubt the validity of our approach. To facilitate understanding of the key points in the debate, we will first summarize the essential statements of our paper. Subsequently, we will respond to the...
متن کاملVertex arboricity and maximum degree
The vertex arboricity of graph G is the minimum number of colors that can be used to color the vertices of G so that each color class induces an acyclic subgraph of G. We prove results such as this: if a connected graph G is neither a cycle nor a clique, then there is a coloring of V(G/ with at most [-A(G)/2 ~ colors, such that each color class induces a forest and one of those induced forests ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2009
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.12.022